Jennifer Cole, Georgia M. Green and Jerry L. Morgan, editors, Linguistics and Computation. CLSI Lecture Notes no 52. Stanford, CA: CLSI, 1995. ISBN 1 881526 81 X, £14.95, xi+296 pages

This book consists of the papers that were presented at a workshop held in June 1991 at the University of Illinois at Urbana-Champaign to celebrate the twenty-fth anniversary of the UIUC Department of Linguistics. The purpose of the workshop was to bring together both computational and more traditional linguists, e.g., syntacticians, morphologists, and phonologists, to discuss important issues of common interest. The ten papers in this book are split over three areas: syntax, automated parsing and generation, and phonology. Though the areas of linguistic research addressed in these papers are diverse, the editors note in the Preface that these papers are nonetheless united by the notion that the principles of grammatical well-formedness and language processing are interdependent, and that research in theoretical and computational linguistics should thus proceed hand in hand. I will say up front that I enjoyed this book very much, and think that the papers therein make a good case for such a joint research eeort. Below I will give brief summaries of the papers in each section, followed by a very short list of the book's aws and a much longer list of its strengths. The rst section of the book focuses on syntax and how it is represented and manipulated within various formal frameworks. Annie Zaenen & Ronald M. Kaplan's "Formal devices for linguistic generalizations: West Germanic word order in LFG" (3{27) shows how non-local dependencies in the innnitival patterns of Dutch and Swiss German can be described within Lexical Functional Grammar (LFG) by invoking two mechanisms (the principles of functional uncertainty and functional precedence) that were originally developed for very diierent purposes. David E. Johnson & Lawrence S. Moss's "Stratiied feature structures for multistratal relational analyses" (29{84) gives a self-contained overview of Stratiied Feature Grammar (SFG), a logic-based extension of relational and metagraph grammar which generalizes the notion of an atomic feature to a sequence of "stratiied" features, each of which encodes a distinct primitive syntactic relation, e.g., direct object. This paper also describes restricted versions of SFG whose weak generative capacities are more appropriate than unrestricted SFG for describing natural languages. The nal paper in this section is Alan M. Frisch's "Feature-based grammars as constraint grammars" (85{100), which shows that the parsing of feature-based grammars can be simpliied by specifying feature-structures implicitly via collections of constraints, and proves the correctness of a generalized context-free parsing strategy for feature-based grammars that operates directly on …